A Solution Method for the Quadratic Assignment Problem (QAP)
نویسندگان
چکیده
The classic Quadratic Assignment Problem (QAP) is one of the most interesting and challenging combinatorial optimization problems in existence. Since QAP is NP-complete, it is notoriously difficult to be solved by exact solution methods. This paper focuses on the intelligent solution methods, particularly, genetic algorithms, and related development on QAP. A hybrid genetic algorithm is devised to examine the solvability of QAP instances. Finally, advances and research trends on the solution of QAP are discussed.
منابع مشابه
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملContinuous Optimization Methods for the Quadratic Assignment Problem
TAO HUANG: Continuous Optimization Methods for the Quadratic Assignment Problem (Under the direction of Jon W. Tolle) In this dissertation we have studied continuous optimization techniques as they are applied in nonlinear 0-1 programming. Specifically, the methods of relaxation with a penalty function have been carefully investigated. When the strong equivalence properties hold, we are guarant...
متن کاملA Matrix-lifting Semidefinite Relaxation for the Quadratic Assignment Problem
The quadratic assignment problem (QAP ) is arguably one of the hardest of the NP-hard discrete optimization problems. Problems of dimension greater than 20 are considered to be large scale. Current successful solution techniques depend on branch and bound methods. However, it is difficult to get strong and inexpensive bounds. In this paper we introduce a new semidefinite programming (SDP ) rela...
متن کامل